How to Visualize the K-Root Name Server (Demo)
نویسندگان
چکیده
We present a novel paradigm to visualize the evolution of the service provided by one of the most popular root name servers, called K-root, operated by the RIPE Network Coordination Centre (RIPE NCC) and distributed in several locations (instances) worldwide. Our approach can be used to either monitor what happened during a prescribed time interval or observe the status of the service in near real-time. We visualize how and when the clients of K-root migrate from one instance to another, how the workload associated with each instance changes over time, and what are the instances that contribute to offer the service to a selected Internet Service Provider. In addition, the visualization aims at distinguishing usual from unusual operational patterns. This helps not only to improve the quality of the service but also to spot security-related issues and to investigate unexpected routing changes. Submitted: December 2011 Reviewed: February 2012 Revised: March 2012 Accepted: May 2012 Final: May 2012 Published: September 2012 Article type: Regular paper Communicated by: M. van Kreveld and B. Speckmann Partially supported by the ESF project 10-EuroGIGA-OP-003 GraDR ”Graph Drawings and Representations” and by the MIUR of Italy, under project AlgoDEEP, prot. 2008TFBWL4. E-mail addresses: [email protected] (Giuseppe Di Battista) [email protected] (Claudio Squarcella) [email protected] (Wolfgang Nagele) 676 Di Battista et al. How to Visualize the K-root Name Server
منابع مشابه
How to Visualize the K-root Name Server
We present a novel paradigm to visualize the evolution of the service provided by one of the most popular root name servers, called K-root, operated by the RIPE Network Coordination Centre (RIPE NCC) and distributed in several locations (instances) worldwide. Our approach can be used to either monitor what happened during a prescribed time interval or observe the status of the service in near r...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملUser-Centric Annotation Management for Biological Data
Annotations play an increasingly crucial role in scientific exploration and discovery, as the amount of data and the level of collaboration among scientists increases. Although all such systems are implemented to take user input (i.e., the annotations themselves), very few systems are user-centric, taking into account user preferences on how annotations should propagate and be applied over data...
متن کاملWow, That’s a Lot of Packets
Organizations operating Root DNS servers report loads exceeding 100 million queries per day. Given the design goals of the DNS, and what we know about today’s Internet, this number is about two orders of magnitude more than we would expect. With the assistance of one root server operator, we took a 24-hour trace of queries arriving at one of the thirteen root servers. In this paper we analyze t...
متن کاملIdentifying Various Kinds of Event Mentions in K-Parser Output
In this paper we show how our semantic parser (Knowledge Parser or K-Parser) identifies various kinds of event mentions in the input text. The types include recursive (complex) and non recursive event mentions. KParser outputs each event mention in form of an acyclic graph with root nodes as the verbs that drive those events. The children nodes of the verbs represent the entities participating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011